Mathematical Logic Well-foundedness in realizability

نویسندگان

  • M. Hofmann
  • T. Streicher
چکیده

However, the implication from (1) to (2) is equivalent to the principle of dependent choices (as the reader can show for himself) and cannot be proved in ZF. A relation < on X is called well-founded if any of these statements holds. Intuitionistically, the three statements are far from equivalent (hence, in formalizing an intuitionistic notion of well-foundedness, care is needed). Notion (1) is, intuitionistically, too weak to be of any use; in contrast, notion (2) is

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realizability algebras III: some examples

The notion of realizability algebra, which was introduced in [17, 18], is a tool to study the proof-program correspondence and to build new models of set theory, which we call realizability models of ZF. It is a variant of the well known notion of combinatory algebra, with a new instruction cc, and a new type for the environments. The sets of forcing conditions, in common use in set theory, are...

متن کامل

From hierarchies to well-foundedness

We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies (of various complexity) have been extensively studied, we point out that (if parameters are allowed) well-foundedness is a necessary condition for the existence of hierarchies e.g. ...

متن کامل

Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness

Assume that we may prove in Arithmetic with Comprehension axiom that a primitive recursive binary relation R is well-founded, using the inductive definition of well-founded. In this paper we prove that the proof that R is well-founded may be made intuitionistic. Our result generalizes to any implication between such formulas. We conclude that if we are able to formulate any mathematical problem...

متن کامل

Variations on Realizability: Realizing the Propositional Axiom of Choice

Early investigators of realizability were interested in metamathematical questions. In keeping with the traditions of the time they concentrated on interpretations of one formal system in another. They considered an ad hoc collection of increasingly ingenious interpretations to establish consistency, independence and conservativity results. van Oosten’s contribution to the Workshop (see van Oos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006